Cellular automata are simple computational elements laid out in a spatial pattern, most commonly a square grid, where each automata's state updates based only on its own state and that of its neighbours. The most well known example is Comway's Game of Life. Very simple rules can give rise to complex emergent behaviour.
Defined on page 378
Used on page 378